Superconducting qubit network with controllable nearest-neighbour coupling
نویسندگان
چکیده
منابع مشابه
Superconducting qubit network with controllable nearest-neighbour coupling
We investigate the design and functionality of a network of loopshaped charge qubits with switchable nearest-neighbour coupling. The qubit coupling is achieved by placing large Josephson junctions (JJs) at the intersections of the qubit loops and selectively applying bias currents. The network is scalable and makes it possible to perform a universal set of quantum gates. The coupling scheme all...
متن کاملSuperconducting qubit with Purcell protection and tunable coupling.
We present a superconducting qubit for the circuit quantum electrodynamics architecture that has a tunable qubit-resonator coupling strength g. This coupling can be tuned from zero to values that are comparable with other superconducting qubits. At g = 0, the qubit is in a decoherence-free subspace with respect to spontaneous emission induced by the Purcell effect. Furthermore, we show that in ...
متن کاملTERZIĆ: SHAPE DETECTION WITH NEAREST NEIGHBOUR CONTOUR FRAGMENTS 1 Shape Detection with Nearest Neighbour Contour Fragments
We present a novel method for shape detection in natural scenes based on incomplete contour fragments and nearest neighbour search. In contrast to popular methods which employ sliding windows, chamfer matching and SVMs, we characterise each contour fragment by a local descriptor and perform a fast nearest-neighbour search to find similar fragments in the training set. Based on this idea, we sho...
متن کاملk-Nearest Neighbour Classifiers
Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier – classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance today because issues of poor run-time performance is not such...
متن کاملEnhanced Nearest Neighbour
Multimedia databases usually deal with huge amounts of data and it is necessary to have an indexing structure such that eecient retrieval of data can be provided. R-Tree with its variations, is a commonly cited indexing method. In this paper we propose an improved nearest neighbor search algorithm on the R-tree and its variants. The improvement lies in the removal of two hueristics that have be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2005
ISSN: 1367-2630
DOI: 10.1088/1367-2630/7/1/178